Search for: All records

Near-Optimal Bayesian Online Assortment of Reusable Resources Motivated by rental services in e-commerce, we consider revenue maximization in the online assortment of reusable resources for different types of arriving consumers. We design competitive online algorithms compared with the optimal online policy in the Bayesian setting, where consumer types are drawn independently from known heterogeneous distributions over time. In scenarios with large initial inventories, our main result is a near-optimal competitive algorithm for reusable resources. Our algorithm relies on an expected linear programming (LP) benchmark, solves this LP, and simulates the solution through independent randomized rounding. The main challenge is achieving inventory feasibility efficiently using these simulation-based algorithms. To address this, we design discarding policies for each resource, balancing inventory feasibility and revenue loss. Discarding a unit of a resource impacts future consumption of other resources, so we introduce postprocessing assortment procedures to design and analyze our discarding policies. Additionally, we present an improved competitive algorithm for nonreusable resources and evaluate our algorithms using numerical simulations on synthetic data. 

Two-Stage Matching and Pricing in Ride-Hailing Platforms Matching and pricing are two critical levers in two-sided marketplaces to connect demand and supply. The platform can produce more efficient matching and pricing decisions by batching the demand requests. We initiate the study of the two-stage stochastic matching problem with or without pricing to enable the platform to make improved decisions in a batch with an eye toward the imminent future demand requests. This problem is motivated in part by applications in online marketplaces, such as ride-hailing platforms. We design online competitive algorithms for vertex-weighted (or unweighted) two-stage stochastic matching for maximizing supply efficiency and two-stage joint matching and pricing for maximizing market efficiency. Using various techniques, such as introducing convex programming–based matching and graph decompositions, submodular maximization, and factor-revealing linear programs, we obtain either optimal competitive or improved approximation algorithms compared with naïve solutions. We enrich our theoretical study by data-driven numerical simulations using DiDi’s ride-sharing data sets. 

We study a natural competitive-information-design variant for the Pandora’s Box problem [31], where each box is associated with a strategic information sender who can design what information about the box’s prize value to be revealed to the agent when she inspects the box. This variant with strategic boxes is motivated by a wide range of real-world economic applications for Pandora’s box. The main contributions of this article are two-fold: (1) we study informational properties of Pandora’s Box by analyzing how a box’s partial information revelation affects the search agent’s optimal decisions; and (2) we fully characterize the pure symmetric equilibrium for the boxes’ competitive information revelation, which reveals various insights regarding information competition and the resultant agent utility at equilibrium. 

Data on population movements can be helpful in designing targeted policy responses to curb epidemic spread. However, it is not clear how to exactly leverage such data and how valuable they might be for the control of epidemics. To explore these questions, we study a spatial epidemic model that explicitly accounts for population movements and propose an optimization framework for obtaining targeted policies that restrict economic activity in different neighborhoods of a city at different levels. We focus on COVID-19 and calibrate our model using the mobile phone data that capture individuals’ movements within New York City (NYC). We use these data to illustrate that targeting can allow for substantially higher employment levels than uniform (city-wide) policies when applied to reduce infections across a region of focus. In our NYC example (which focuses on the control of the disease in April 2020), our main model illustrates that appropriate targeting achieves a reduction in infections in all neighborhoods while resuming 23.1%–42.4% of the baseline nonteleworkable employment level. By contrast, uniform restriction policies that achieve the same policy goal permit 3.92–6.25 times less nonteleworkable employment. Our optimization framework demonstrates the potential of targeting to limit the economic costs of unemployment while curbing the spread of an epidemic. This paper was accepted by Carri Chan, healthcare management.